package 算法.练习1;

/**
 * @author:谢君臣
 * @Date:2021/7/20-16:20
 * @version:1.0
 * @function:
 */
public class NC68 {

    public static void main(String[] args) {
        System.out.println(jumpFloor(7));
    }
    public static int jumpFloor(int target) {
        int[] dp = new int[target+1];
        dp[0]=dp[1]=1;
        for (int i = 2; i <= target; i++) {
            dp[i] = dp[i-1]+dp[i-2];
        }
        return dp[target];
    }
}
